Reduced-Complexity Decoding of Low Density Parity Check Codes for Generalized Partial Response Channels
نویسندگان
چکیده
The performance of low-density parity-check (LDPC) codes serially concatenated with generalized partial response channels is investigated. Various soft-input/soft-output detection schemes suitable for use in iterative detection/decoding systems are described. A low-complexity near-optimal detection algorithm that incorporates soft-input reliability information and generates soft-output reliability information is presented. A reduced-complexity algorithm for decoding LDPC codes is described. Simulation results on the performance of high-rate LDPC codes on generalized PR channels at various recording densities are presented. These results indicate that a judicious selection of the inner detector target polynomial and the choice of a good LDPC code are important in optimizing the performance of the overall recording system. Furthermore, the results also show that iterative detection/decoding schemes using LDPC codes can outperform hard-decision decoding of Reed–Solomon codes by over 2 dB at a sector error rate of 10 .
منابع مشابه
Search Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملInterior Point Decoding for Linear Vector Channels
In this paper, a novel decoding algorithm for lowdensity parity-check (LDPC) codes based on convex optimization is presented. The decoding algorithm, called interior point decoding, is designed for linear vector channels. The linear vector channels include many practically important channels such as inter symbol interference channels and partial response channels. It is shown that the maximum l...
متن کاملThresholds for Iterative Equalization of Partial Response Channels Using Density Evolution
This paper focuses on the computing of the thresholds for iterative equalization and decoding of partial response channel, such as what are of interest in high density magnetic recording. Extensive simulations on the performance of turbo codes, low density parity check (LDPC) codes and single-parity check turbo product codes (TPC/SPC) over partial response channels reveal very encouraging bit e...
متن کاملHigh-performance, low-complexity decoding of generalized low-density parity-check codes
A class of pseudo-random compound error-correcting codes, called Generalized Low-Density (GLD) Parity-Check codes, has been proposed recently. As a generalization of Gallager’s Low-Density ParityCheck (LDPC) codes, GLD codes are also asymptotically good in the sense of minimum distance criterion and can be effectively decoded based on iterative soft-input soft-output (SISO) decoding of individu...
متن کامل